/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
ll mp[310][310];
ll n, m, k;
ll v[21000][310];
bool vis[310];
int main()
{
    IOS;
    cin >> n >> m;
    ll x, y, c;

    for (ll i = 1; i <= m; i++)
    {
        cin >> x >> y >> c;
        mp[x][y] = mp[y][x] = c;
    }
    cin >> k;
    for (ll i = 1; i <= k; i++)
    {
        cin >> v[i][0];
        for (ll j = 1; j <= v[i][0]; j++)
        {
            cin >> v[i][j];
        }
    }
    ll ans = (ll)1e12;
    for (ll i = 1; i <= k; i++)
    {
        if (v[i][0] != n)
        {
            continue;
        }
        ll las = 0;
        ll sum = 0;
        memset(vis, false, sizeof(vis));
        for (ll j = 1; j <= v[i][0]; j++)
        {
            if (mp[las][v[i][j]] > 0 && !vis[v[i][j]])
            {

                sum += mp[las][v[i][j]];
                las = v[i][j];
                vis[v[i][j]] = true;
            }
            else
            {
                sum = -1;
                break;
            }
        }
        if (sum != -1 && mp[v[i][v[i][0]]][0])
        {
            ans = min(ans, sum + mp[v[i][v[i][0]]][0]);
        }
    }
    if (ans == (ll)(1e12))
    {
        cout << -1 << endl;
    }
    else
        cout << ans << endl;
    getchar();
    getchar();
    return 0;
}
